Using Inference to Reduce Arc Consistency Computation
نویسندگان
چکیده
Chr is t ian Bessiere LIRMM (UMR 9928 CNRS), 161 rue Ada 34392 Montpellier cedex 5, France phone: (33) 67 41 85 39 fax: (33) 67 41 85 00 e-mail: bessiereClirnn.fr Eugene C. Freuder University of New Hampshire Durham, NH 03824 USA phone: 603-862-1867 fax: 603-862-3493 e-mail: ecfCcs.unh.edu Jean-Charles Regin GDR 1093 CNRS, LIRMM, 161 rue Ada 34392 Montpellier cedex 5, Prance phone: (33) 67 41 85 80 fax: (33) 67 41 85 00 e-mail: reginClinnm.fr
منابع مشابه
Using Constraint Metaknowledge to Reduce Arc Consistency Computation
Constraint satisfaction problems are widely used in artiicial intelligence. They involve nding values for problem variables subject to constraints that specify which combinations of values are consistent. Knowledge about properties of the constraints can permit inferences that reduce the cost of consistency checking. In particular, such inferences can be used to reduce the number of constraint ...
متن کاملA Generalization of Generalized Arc Consistency: From Constraint Satisfaction to Constraint-Based Inference
Arc consistency and generalized arc consistency are two of the most important local consistency techniques for binary and non-binary classic constraint satisfaction problems (CSPs). Based on the Semiring CSP and Valued CSP frameworks, arc consistency has also been extended to handle soft constraint satisfaction problems such as fuzzy CSP, probabilistic CSP, max CSP, and weighted CSP. This exten...
متن کاملA Theoretical Framework for Consistency Techniques in Logic Programming
While being a powerful paradigm for solving Constraint Satisfaction Problems (CSPs), Consistency Techniques (CTs) have never been taken into account during the design of declarative programming languages. This paper defines a theoretical framework for using CTs inside logic programming. Three inference rules are introduced and their formal properties are investigated. Also, computation rules ar...
متن کاملA Greedy Approach to Establish Singleton Arc Consistency
In this paper, we propose a new approach to establish Singleton Arc Consistency (SAC) on constraint networks. While the principle of existing SAC algorithms involves performing a breadth-first search up to a depth equal to 1, the principle of the two algorithms introduced in this paper involves performing several runs of a greedy search (where at each step, arc consistency is maintained). It is...
متن کاملProbabilistic Consistency Boosts MAC and SAC
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de facto standard to solve CSPs. Maintaining higher levels of consistency, generally, reduces the search effort. However, due to ineffective constraint propagation, it often penalises the search algorithm in terms of time....
متن کامل